#define _CRT_SECURE_NO_WARNINGS 1
#include"BinarySearchTree.h"
using namespace key;
int main()
{
	BSTree<int> bt;
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	for (auto x : a)
	{
		bt.InsertR(x);
	}

	/*for (auto x : a)
	{
		bt.EraseR(x);
		bt.Inorder();
	}*/

	BSTree<int> s(bt);
	s.Inorder();

	BSTree<int> t;
	t = bt;
	t.Inorder();
	return 0;
}